In coset decoding, a received word <I>w</i> is decoded as a code word <i>c</i> such that <i>d</I>(<i>w,c</i>)  is a minimum. This is the same as
nearest-neighbor decoding.